Distributions Modulo Subgroups of GF(q)
نویسنده
چکیده
We consider recursive sequences over GF(q) (the Galois field with q elements) generated by an irreducible polynomialfof degree 12. All roots of f have the same order e (called the exponent off) in the multiplicative group GF(qn)* = GF(q”) (0). Every nonzero recursive sequence generated byf is periodic with period e, and there are (up to translation) (4% 1)/e nonzerof-sequences [l], [2]. If e = q” 1 the polynomia1.f is primitive, and in a single period of the nonzero f-sequence zeros appear qn-l 1 times and every nonzero element appears q”-l times. This is easily seen because every n-tuple except all zero must appear exactly once in a period. If e < qn 1 the distribution of elements within each individual nonzero f-sequence need not be so nearly uniform. We shall show that for certain values of e the distribution of each f-sequence is uniform over the cosets of a certain subgroup of the multiplicative group of GF(q)*. Specifically this occurs when [e, q 11, the least common multiple of e and q 1, is q” 1.
منابع مشابه
An algorithm for the k-error linear complexity of a sequence with period 2pn over GF(q)
The union cost is used, so that an efficient algorithm for computing the k-error linear complexity of a sequence with period 2p n over GF(q) is presented, where p and q are odd primes, and q is a primitive root of modulo p 2 .
متن کاملCYCLIC CODES OF LENTH N OVER ( ) GF q q – CYCLOTOMIC COSETS MODULO N AND APPLICATION OF BURNSIDE ’ S LEMMA
The idea of q cyclotomic cosets modulo n due to carry Huffman and Vera pless is considered in the context of linear codes of length n over ( ) GF q where m q p , p is a prime, 1 m . An explicit formula for the number of q cyclostomes cosets modulo is obtained as an application of the classical Burnsides lemnra. The formula for the number of cyclic codes in ( 1) n n q R F x x is dedu...
متن کاملFast Algorithms for Determining the Linear Complexity of Period Sequences
We introduce a fast algorithm for determining the linear complexity and the minimal polynomial of a sequence with period p over GF(q) , where p is an odd prime, q is a prime and a primitive root modulo p; and its two generalized algorithms. One is the algorithm for determining the linear complexity and the minimal polynomial of a sequence with period pq over GF(q), the other is the algorithm fo...
متن کاملA Fast Algorithm for Determining the Linear Complexity of Periodic Sequences over GF(3)
Jianqin Zhou (Dept. of Computer Science, Anhui University of Technology, Ma’anshan 243002, P. R. China) (E-mail: [email protected]) Abstract: A fast algorithm is presented for determining the linear complexity and the minimal polynomial of periodic sequences over GF(q) with period q n p m , where p is a prime, q is a prime and a primitive root modulo p. The algorithm presented here generalizes...
متن کاملNew array codes for multiple phased burst correction
Abstmct-A new optimal family of array codes over GF(q) for correcting multiple phased burst errors and erasures, where each phased burst corresponds to an erroneous or erased column in a code array, is presented. As for erasures, these array codes have an efficient decoding algorithm which avoids multiplications (or divisions) over extension fields, replacing these operations with cyclic shifts...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 15 شماره
صفحات -
تاریخ انتشار 1973